Limit Polygons of Convex Domains in the Projective Plane

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Cubic Differentials and Convex Polygons in the Projective Plane

We construct and study a natural homeomorphism between the moduli space of polynomial cubic differentials of degree d on the complex plane and the space of projective equivalence classes of oriented convex polygons with d+3 vertices. This map arises from the construction of a complete hyperbolic affine sphere with prescribed Pick differential, and can be seen as an analogue of the Labourie– Lof...

متن کامل

Covering the Plane with Convex Polygons

It is proved that for any centrally symmetric convex polygonal domain P and for any natural number r, there exists a constant k = k(P, r) such that any k-fold covering of the plane with translates of P can be split into r simple coverings.

متن کامل

The Common Exterior of Convex Polygons in the Plane

We establish several combinatorial bounds on the complexity (number of vertices and edges) of the complement of the union (also known as the common exterior) of k convex polygons in the plane, with a total of n edges. We show: 1. The maximum complexity of the entire common exterior is (nn(k) + k 2). 1 2. The maximum complexity of a single cell of the common exterior is (nn(k)). 3. The complexit...

متن کامل

Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane

We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two nonoverlapping convex polygons in the plane. Given two non-overlapping convex polygons P1 and P2 in the plane, the ham-sandwich cut of P1 and P2 is a line that simultaneously bisects the area (or perimeter or vertex count) of both polygons. We provide a data structure that supports queries for the ham-s...

متن کامل

Configuration spaces of convex and embedded polygons in the plane

A celebrated result of Connelly, Demaine, and Rote [6] states that any polygon in the plane can be “convexified.” That is, the polygon can be deformed in a continuous manner until it becomes convex, all the while preserving the lengths of the sides and without allowing the sides to intersect one another. In the language of topology, their argument shows that the configuration space of embedded ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2020

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnaa259